Complete theory

Results: 1780



#Item
51Graph theory / Mathematics / Graph operations / NP-complete problems / Graph coloring / Topological graph theory / Line graph / Graph homomorphism / Graph / Graph property / Signed graph

A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar

Add to Reading List

Source URL: sharif.ir

Language: English - Date: 2013-10-17 07:17:33
52Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Matching / Combinatorial optimization / Dominating set / Vertex cover / Transportation theory / Distribution

Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-06-22 05:23:03
53Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Graph / Travelling salesman problem / Vertex / Cycle / Hamiltonian path / Graph automorphism / Vertex cover

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Add to Reading List

Source URL: www.iwr.uni-heidelberg.de

Language: English - Date: 2013-06-19 04:16:58
54Graph theory / Mathematics / Operations research / Mathematical optimization / NP-complete problems / Dynamic programming / Equations / Systems engineering / Independent set / Interval scheduling / Interval graph / Approximation algorithm

1 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2012-02-08 11:20:14
55Computational complexity theory / Theory of computation / Complexity classes / Structural complexity theory / Conjectures / Probability distributions / NP / Polynomial hierarchy / IP / P versus NP problem / PP / P

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2001-10-25 12:45:35
56Graph theory / NP-complete problems / Spanning tree / Axiom of choice / Graph coloring / Tree

arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

Add to Reading List

Source URL: www.grupolys.org

Language: English - Date: 2016-05-11 06:39:57
57Mathematics / Order theory / Algebra / Abstract algebra / Abstract interpretation / Galois connection / Fixed-point theorem / Fixed point / FO / Complete lattice / Lattice / Monotonic function

Abstract Interpretation, Reloaded Jan Midtgaard Winter School, Day 3 http://janmidtgaard.dk/aiws15/ Saint Petersburg, Russia, 2015

Add to Reading List

Source URL: janmidtgaard.dk

Language: English - Date: 2015-02-04 08:44:50
58Graph theory / NP-complete problems / Clique / Clique cover / Graph coloring

CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-10-27 18:59:34
59Algebra / Linear algebra / Mathematics / Numerical linear algebra / Sparse matrices / Matrix theory / Matrices / Singular value decomposition / Bidiagonalization / Bidiagonal matrix / QR algorithm / Orthogonal matrix

Computing the Complete CS Decomposition Brian D. Sutton∗ May 20, 2008 Abstract An algorithm for computing the complete CS decomposition of a partitioned unitary matrix is developed. Although the existence of the CS dec

Add to Reading List

Source URL: faculty.rmc.edu

Language: English - Date: 2008-05-20 14:06:05
60Mathematics / Mathematical analysis / Order theory / Structure / Lattice theory / Complete lattice / Lattice / Abstract interpretation / Monotonic function / Fixed point / QuickCheck / KnasterTarski theorem

QuickChecking Static Analysis Properties Jan Midtgaard and Anders Møller Abstract Interpretation Winter School From forthcoming ICST’15 paper

Add to Reading List

Source URL: janmidtgaard.dk

Language: English - Date: 2015-02-06 02:29:00
UPDATE